Clique Detection via Genetic Programming
نویسنده
چکیده
Thomas Haynes CS 7863 Topics in Combinatorial Optimization Department of Mathematical & Computer Sciences The University of Tulsa e{mail: [email protected] December 28, 1996 Abstract Genetic Programming is utilized as a technique for detecting cliques in a network. Candidate cliques are represented in lists, and the lists are manipulated such that larger cliques are formed from the candidates. The clique detection problem has some interesting implications to the Strongly Typed Genetic Programming paradigm, namely in forming a class hierarchy. The problem is also useful in that it is easy to add noise.
منابع مشابه
Perturbing the Representation, Decoding, and Evaluation of Chromosomes
We investigate diierent genetic algorithm and genetic programming variants of representation , decoding, and evaluation of chromosomes for clique detection in graph. Small changes can drastically impact nd-ing the evolutionary process, making fair comparisons diicult.
متن کاملPhenotypical Building Blocks for Genetic Programming
The theoretical foundations of genetic algorithms (GA) rest on the shoulders of the Schema Theorem, which states that the building blocks, highly t compact subsets of the chromosome, are more likely to survive from one generation to the next. The theory of genetic programming (GP) is tenuous , borrowing heavily from that of GA. As the GP can be considered to be a GA operating on a tree structur...
متن کاملAvoiding Two-Bit Crossovers in Genetic Programming
We investigate the utility of weighting the crossover points in genetic programming. The depth-fair crossover (DFC) operator is introduced as an alternative to the standard 90=10 weight heuristic. The DFC weight heuristic performs better that the standard 90=10 weight heuristic in the clique domain. Preliminary results also indicate it will perform better in other applications.
متن کاملClique Detection as a Royal Road Function
Royal Road functions manipulate the t-ness landscape to provide controlled experiments into genetic algorithm (GA) theory Mitchell et al., 1992]. Variations of clique detection in a graph, e.g., nding both the max clique Soule et al., 1996] and the clique cover Haynes, 1996], have been proposed as naturally occurring Royal Road functions. Soule and Foster have tried to positively correlate diie...
متن کاملFinding the Number of Members with Certain Relationships in Social Networks and Big Size Organizations using Copositive Programming
In social networks and big size organizations, finding the number of members that all of them have a certain relationship w* is an important problem for managers, as well the number of members that none of them has not the relationship (w*). Considering the members as vertices and the relationship as edges, w* and w* denote the clique number and the number of edges in the independent graph, re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995